Automata and Coinduction
نویسنده
چکیده
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra. " 9 9 9 i n this case, as in many others, the process gives the m i n i m a l machine directly to anyone skilled in input differentiation. T h e skill is worth acquiring . . . " J . H . C o n w a y [ C o n 7 1 , c h a p . 5]
منابع مشابه
Automata and Coinduction (an Exercise in Coalgebra) Automata and Coinduction (an Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomor-phism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the p...
متن کاملVerifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed Automata (PTA). We show how PTAs can be elegantly modeled via logic programming extended with coinduction and constraints over reals. We use this logic programming realization of a PTA to develop an elegant solution t...
متن کاملControl of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory control. A framework for control of discre...
متن کاملCentrum Voor Wiskunde En Informatica Reportrapport Behavioural Differential Equations: a Coinductive Calculus of Streams, Automata, and Power Series Behavioural Diierential Equations: a Coinductive Calculus of Streams, Automata, and Power Series
Streams, automata and languages, and formal power series are viewed coalgebraically. In summary , this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being nal. Finality then forms the basis for both deenitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive deenitions take the shape of what we h a v...
متن کاملBehavioural Differential Equations: a Coinductive Calculus of Streams, Automata, and Power Series Behavioural Diierential Equations: a Coinductive Calculus of Streams, Automata, and Power Series
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary , this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being nal. Finality then forms the basis for both deenitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive deenitions take the shape of what we hav...
متن کامل